import com.sun.xml.internal.ws.api.model.wsdl.WSDLOutput;

import java.util.Scanner;
import java.lang.Math;

public class TestDemo {
    /*
    public static void main(String[] args) {
        int n ;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <=i ; j++) {
                System.out.print(j + " * " + i + " = " + i*j + " ");
            }
            System.out.println();
        }
    }
     */

    /*
    public static void main(String[] args) {
        String PassCode = "nishizhu";
        String str;
        Scanner sc = new Scanner(System.in);
        int j = 3;
        for (int i = 0; i < 3; i++) {
            str = sc.next();
            if (str.equals(PassCode)) {
                System.out.println("Log in successful");
                break;
            } else {
                System.out.println("wrong pass word!");
                --j;
            }
        }
        if (j == 0) {
            System.out.println("Account locked!");
        }
        sc.close();
    }
    */

    /*
    public static void main(String[] args) {
        int n;
        int cnt = 0;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        while (n != 0) {
            if ((n & 1) == 1) {
                ++cnt;
            }
            n>>>=1;
        }
        sc.close();
        System.out.println(cnt);
    }
     */

    /*
    public static void main(String[] args) {
        int n;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        System.out.println("奇数位：");
        for (int i = 31; i >=1 ; i-=2) {
            System.out.print((n >> i) & 1);
        }
        System.out.println();
        System.out.println("偶数位：");
        for (int i = 30; i >=0 ; i-=2) {
            System.out.print((n >> i) & 1);
        }
        sc.close();
    }
     */

    /*
    public static void main(String[] args) {
        int m;
        int n;
        int temp;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
        while (m != 0) {
            temp = n % m;
            n = m;
            m = temp;
        }
        sc.close();
        System.out.println(n);
    }
     */

    /*
    public static void main(String[] args) {
        int sum = 0;
        int temp;
        System.out.print("0" + " ");
        for (int i = 1; i <1000 ; i++) {
            temp = i;
            sum = 0;
            while (temp != 0) {
                sum += (int)Math.pow(temp % 10,3);
                 temp /= 10;
            }
            if (sum == i) {
                System.out.println(sum + " ");
            }
        }
    }
     */

    /*
    public static void main(String[] args) {
        int age = 0;
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            age = sc.nextInt();
            if (age <= 18) {
                System.out.println("少年！！！！");

            } else if ((age > 18) && (age < 28)) {
                System.out.println("青年人哦");

            } else if ((age > 28) && (age < 55)) {
                System.out.println("中年人ovo");
            } else {
                System.out.println("老年人owo");
            }
        }
        sc.close();
    }
     */

    /*
    public static boolean isPrime(int num) {
        if (num == 1) {
            return false;
        }
        for (int i = 2; i <Math.sqrt(num) ; i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
     */


    /*public static void main(String[] args) {
        int n;
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            n = sc.nextInt();
            if (isPrime(n)) {
                System.out.println(n + " is a prime");
            } else {
                System.out.println(n + " is not a prime");
            }
        }
        sc.close();
    }
     */

    /*
    public static void main(String[] args) {
        for (int i = 1; i <101 ; i++) {
            if (isPrime(i)) {
                System.out.print(i + " ");
            }
        }
}
     */

    /*
    public static void main(String[] args) {
        int count = 0;
        for (int i = 1000; i <2001 ; i++) {
            if((i % 4 ==0 && i % 100 !=0)||(i % 400 == 0)) {
                System.out.print(i + " ");
                count++;
            }
            if (count == 30) {
                count = 0;
                System.out.println();
            }
        }
    }
     */

    /*
    struct ListNode* middleNode(struct ListNode* head)
{
    struct ListNode* fast = head;
    struct ListNode* slow = head;
    while(fast&&fast->next)
    {
        fast = fast->next->next;
        slow = slow->next;
    }
    return slow;
}
     */

    /*
    class Solution {
    public ListNode swapPairs(ListNode head) {
        ListNode Head = new ListNode(0);
        Head.next = head;
        ListNode temp = Head;
        while (temp.next != null && temp.next.next != null) {
            ListNode p1 = temp.next;
            ListNode p2 = temp.next.next;
            temp.next = p2;
            p1.next = p2.next;
            p2.next = p1;
            temp = p1;
        }
        return Head.next;
    }
}
     */

    /*
    class Solution {
    public ListNode removeElements(ListNode head, int val) {

        ListNode NewHead = new ListNode(-1);
        NewHead.next = head;
        ListNode cur = NewHead;
        ListNode prev = NewHead;
        while (cur != null) {
            if (cur.val == val) {
                prev.next = cur.next;
                cur = cur.next;
            } else {
                prev = cur;
                cur = cur.next;
            }
        }
        return NewHead.next;
    }
     */

    /*
    class Solution {
    public int getDecimalValue(ListNode head) {
        ListNode cur = head;
        int cnt = 0, sum = 0;
        while (cur != null) {
            cnt++;
            cur = cur.next;
        }
        --cnt;
        cur = head;
        while (cur != null) {
            sum += cur.val * (int)Math.pow(2,cnt--);
            cur = cur.next;
        }
        return sum;
    }
}
     */

    /*
    class Solution {
    public int[] reversePrint(ListNode head) {
        if (head == null) {
            return null;
        }
        int cnt = 0;
        int i = 0;
        int j = 0;
        ListNode cur = head;
        while (cur != null) {
            cnt++;
            cur = cur.next;
        }
        int[] arr1 = new int[cnt];
        int[] arr2 = new int[cnt];
        cur = head;
        while (cur!=null) {
            arr1[i++] = cur.val;
            cur = cur.next;
        }
        --i;
        while (i >= 0) {
            arr2[j++] = arr1[i--];
        }
        return arr2;

    }
}
     */

    public static void main(String[] args) {
        System.out.println("Feeling tired today!!!!!");
    }
}
